sibling nodes

См. также в других словарях:

• B-tree — In computer science, a B tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. It is most commonly used in databases and filesystems. In B trees, internal (non leaf)… …   Wikipedia

• Hilbert R-tree — Hilbert R tree, an R tree variant, is an index for multidimensional objects like lines, regions, 3 D objects, or high dimensional feature based parametric objects. It can be thought of as an extension to B+ tree for multidimensional objects.The… …   Wikipedia

• 2-3-4 tree — A 2 3 4 tree (also called a 2 4 tree), in computer science, is a self balancing data structure that is commonly used to implement dictionaries. 2 3 4 trees are B trees of order 4; like B trees in general, they can search, insert and delete in… …   Wikipedia

• c-command — noun The relationship between a node in a parse tree and its sibling nodes (usually meaning the children of the first branching node that dominates the node) and all their children …   Wiktionary

• Red-black tree — A red black tree is a type of self balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them symmetric… …   Wikipedia

• Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… …   Wikipedia

• Method of analytic tableaux — A graphical representation of a partially built propositional tableau In proof theory, the semantic tableau (or truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulas of first order logic. The… …   Wikipedia

• XFLAIM Database Engine — Infobox Software name = XFLAIM caption = latest release version = latest release date = operating system = Cross platform genre = Development Library license = GPL website = [http://developer.novell.com/wiki/index.php/FLAIM XFLAIM] TOC… …   Wikipedia

• Tree structure — A tree structure showing the possible hierarchical organization of an encyclopedia …   Wikipedia

• Adaptive Huffman coding — (also called Dynamic Huffman coding) is an adaptive coding technique based on Huffman coding. It permits building the code as the symbols are being transmitted, having no initial knowledge of source distribution, that allows one pass encoding and …   Wikipedia

• Heapsort — Infobox Algorithm class=Sorting algorithm A run of the heapsort algorithm sorting an array of randomly permuted values. In the first stage of the algorithm the array elements are reordered to satisfy the heap property. Before the actual sorting… …   Wikipedia